Polynomial perturbations of bilinear functionals and Hessenberg matrices
نویسنده
چکیده
This paper deals with symmetric and non-symmetric polynomial perturbations of symmetric quasi-de nite bilinear functionals. We establish a relation between the Hessenberg matrices associated with the initial and the perturbed functionals using LU and QR factorizations. Moreover we give an explicit algebraic relation between the sequences of orthogonal polynomials associated with both functionals.
منابع مشابه
Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle
Let L̂ be a positive definite bilinear functional on the unit circle defined on Pn, the space of polynomials of degree at most n. Then its Geronimus transformation L is defined by L̂(p, q) = L ( (z − α)p(z), (z − α)q(z) ) for all p, q ∈ Pn, α ∈ C. Given L̂, there are infinitely many such L which can be described by a complex free parameter. The Hessenberg matrix that appears in the recurrence rela...
متن کاملSome Results on Polynomial Numerical Hulls of Perturbed Matrices
In this paper, the behavior of the pseudopolynomial numerical hull of a square complex matrix with respect to structured perturbations and its radius is investigated.
متن کامل5 M ay 2 00 5 Jacobians and rank 1 perturbations relating to unitary Hessenberg matrices
In a recent work Killip and Nenciu gave random recurrences for the characteristic polynomials of certain unitary and real orthogonal upper Hessenberg matrices. The corresponding eigenvalue p.d.f.’s are β-generalizations of the classical groups. Left open was the direct calculation of certain Jacobians. We provide the sought direct calculation. Furthermore, we show how a multiplicative rank 1 pe...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملA polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem
We give a polynomial-time dynamic programming algorithm for solving the linear complementarity problem with tridiagonal or, more generally, Hessenberg P-matrices. We briefly review three known tractable matrix classes and show that none of them contains all tridiagonal P-matrices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005